Further delay moment results for FIFO multiserver queues
نویسنده
چکیده
Using a new family of service disciplines, we provide weaker su cient conditions for nite stationary delay moments in FIFO multiserver queues. This extends the work in Sigman and Scheller-Wolf[1997] to GI=GI=s queues with = E[S]=E[T ] < s 1, where S and T are generic service and interarrival times, respectively. Thus, only when > s 1 are the familiar Kie er and Wolfowitz conditions actually necessary. For the case when < 1, we provide su cient conditions for nite mean stationary delay which are a function of the number of servers in the system. As one would expect, these conditions approach the condition for nite mean stationary delay in a FIFO GI=GI=1 queue, E[S] <1, as s approaches in nity. Our results demonstrate the interplay between tra c intensity and service time distribution in determining the behavior of delay moments in multiserver queues. This is a relationship previously overlooked in the literature.
منابع مشابه
Sink or swim together: necessary and sufficient conditions for finite moments of workload components in FIFO multiserver queues
Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload component...
متن کاملFinite Moments of Workload Components in FIFO Multiserver Queues
Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload component...
متن کاملRelationship between Delay and System Contents in Multiserver Queues with Geometric Service Times
In this paper, we consider a discrete-time multiserver queueing system with infinite buffer size, geometric service times and a FCFS (first-come-first-served) queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. The relationship is general in the sense that it doesn’t require knowledge of the exact nature of the ar...
متن کاملStandard and Retrial Queueing Systems: a Comparative Analysis
We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues wit...
متن کاملReal-Time Delay Estimation in Overloaded Multiserver Queues with Abandonments
We use heavy-traffic limits and computer simulation to study the performance of alternative real-time delay estimators in the overloaded GI/GI/s+GI multiserver queueing model, allowing customer abandonment. These delay estimates may be used to make delay announcements in call centers and related service systems. We characterize performance by the expected mean squared error in steady state. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 34 شماره
صفحات -
تاریخ انتشار 2000